Memetic Algorithm Based on a Constraint Satisfaction Technique for VRPTW

نویسندگان

  • Marco Antonio Cruz-Chavez
  • Ocotlán Díaz-Parra
  • David Juárez-Romero
  • Martín G. Martínez-Rangel
چکیده

In this paper a Memetic Algorithm (MA) is proposed for solving the Vehicles Routing Problem with Time Windows (VRPTW) multi-objective, using a constraint satisfaction heuristic that allows pruning of the search space to direct a search towards good solutions. An evolutionary heuristic is applied in order to establish the crossover and mutation between sub-routes. The results of MA demonstrate that the use of Constraints Satisfaction Technique permits MA to work more ef…ciently in the VRPTW.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Algorithm for the Vehicles Routing Problem with Time Windows Based on a Constraint Satisfaction Technique1 Algoritmo Evolutivo para el Problema de Ruteo de Vehículos con Ventanas de Tiempo Basado en una Técnica de Satisfacción de Restricciones

In this paper a Memetic Algorithm (MA) is proposed for solving the Vehicles Routing Problem with Time Windows (VRPTW) multi-objective, using a constraint satisfaction heuristic that allows pruning of the search space to direct a search towards good solutions that represent the individuals of the population. An evolutionary heuristic is applied in order to establish the crossover and mutation be...

متن کامل

A multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem

In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...

متن کامل

A Memetic Algorithm with Bucket Elimination for the Still Life Problem

Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of BE with evolutionary algorithms endowed with tabu search. The resulting memetic algorithm (MA) uses BE as a mechanism for recombining solutions, providing the best possible child from the parental set. This MA is applied to the...

متن کامل

Solving Weighted Constraint Satisfaction Problems with Memetic/Exact Hybrid Algorithms

A weighted constraint satisfaction problem (WCSP) is a constraint satisfaction problem in which preferences among solutions can be expressed. Bucket elimination is a complete technique commonly used to solve this kind of constraint satisfaction problem. When the memory required to apply bucket elimination is too high, a heuristic method based on it (denominated mini-buckets) can be used to calc...

متن کامل

Finding Still Lifes with Memetic/Exact Hybrid Algorithms

The maximum density still life problem (MDSLP) is a hard constraint optimization problem based on Conway’s game of life. It is a prime example of weighted constrained optimization problem that has been recently tackled in the constraint-programming community. Bucket elimination (BE) is a complete technique commonly used to solve this kind of constraint satisfaction problem. When the memory requ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008